Equivalence Relations Polynomial Interpolation Public Key Crypotography
نویسندگان
چکیده
We present an environment for learning and teaching mathematics that aims at inspiring the creative potential of students by enabling the learners to perform various kinds of interactive experiments during their learning process. Computer interactions are both of visual and purely formal mathematical nature, where the computer-algebra system Mathematica powers the visualization of mathematical concepts and the tools provided by the theorem proving system Theorema are used for the formal counterparts. We present a case study on the concept of convergence of real-valued sequences, in which we demonstrate the entire bandwidth of computer-support that we envision for modern learning environments for mathematics ranging from “getting first ideas and intuitions” over “checking the validity of first ideas on a wide variety of examples” until “rigorously proving or disproving one’s own conjectures”.
منابع مشابه
Stimulating Students' Creativity Through Computer- Supported Experiments and Automated Theorem Proving
We present an environment for learning and teaching mathematics that aims at inspiring the creative potential of students by enabling the learners to perform various kinds of interactive computer experiments during their learning process. Computer interactions are both of visual and purely formal mathematical nature, where the computer-algebra system Mathematica powers the visualization of math...
متن کاملEfficient Polynomial Operations in the Shared-Coefficients Setting
We study the design of efficient and private protocols for polynomial operations in the shared-coefficients setting. We propose efficient protocols for polynomial multiplication, division with remainder, polynomial interpolation, polynomial gcd, and a few other operations. All the protocols introduced in this paper are constant-round, and more efficient than the general MPC. The protocols are a...
متن کاملMaximum Modulus, Maximum Term and Interpolation Error of an Entire Function
Let f be analytic on the compact set E ⊂ C , of positive transfinite diameter and let Cr denote the largest equipotential curve of E such that f is analytic within Cr. Generally, the growth of an entire function is measured in terms of its order and type. Here we have established the relations between maximum modulus, maximum term and interpolation error of best uniform approximation to a funct...
متن کاملEfficient Public Key Generation for Multivariate Cryptosystems
Asymmetric cryptographic systems using multivariate polynomials over finite fields have been proposed several times since the 1980s. Although some of them have been successfully broken, the area is still vital and promises interesting algorithms with low computational costs, short message, and signature sizes. In this paper, we present two novel strategies “base transformation” and “adapted eva...
متن کاملAitken and Neville inverse interpolation methods for the Lucas logarithm problem
The Lucas function is a recently proposed one-way function used in public key cryptography. The security of cryptosystems based on the Lucas function relies on the difficulty of solving the Lucas logarithm problem. In this paper, the Lucas logarithm problem is studied using interpolation techniques. In particular, the inverse Aitken and the inverse Neville interpolation methods are applied to v...
متن کامل